Bounds for Sparse Pca with Noisy High - Dimensional Data
نویسندگان
چکیده
We study the problem of estimating the leading eigenvectors of a high-dimensional population covariance matrix based on independent Gaussian observations. We establish a lower bound on the minimax risk of estimators under the l2 loss, in the joint limit as dimension and sample size increase to infinity, under various models of sparsity for the population eigenvectors. The lower bound on the risk points to the existence of different regimes of sparsity of the eigenvectors. We also propose a new method for estimating the eigenvectors by a two-stage coordinate selection scheme.
منابع مشابه
Minimax Bounds for Sparse Pca with Noisy High-dimensional Data by Aharon Birnbaum,
We study the problem of estimating the leading eigenvectors of a highdimensional population covariance matrix based on independent Gaussian observations. We establish a lower bound on the minimax risk of estimators under the l2 loss, in the joint limit as dimension and sample size increase to infinity, under various models of sparsity for the population eigenvectors. The lower bound on the risk...
متن کاملSparse variable noisy PCA using l0 penalty
Sparse principal component analysis combines the idea of sparsity with principal component analysis (PCA). There are two kinds of sparse PCA; sparse loading PCA (slPCA) which keeps all the variables but zeroes out some of their loadings; and sparse variable PCA (svPCA) which removes whole variables by simultaneously zeroing out all the loadings on some variables. In this paper we propose a mode...
متن کاملMinimax Bounds for Sparse Pca with Noisy High-dimensional Data.
We study the problem of estimating the leading eigenvectors of a high-dimensional population covariance matrix based on independent Gaussian observations. We establish a lower bound on the minimax risk of estimators under the l2 loss, in the joint limit as dimension and sample size increase to infinity, under various models of sparsity for the population eigenvectors. The lower bound on the ris...
متن کاملMinimax Rates of Estimation for Sparse PCA in High Dimensions
We study sparse principal components analysis in the high-dimensional setting, where p (the number of variables) can be much larger than n (the number of observations). We prove optimal, non-asymptotic lower and upper bounds on the minimax estimation error for the leading eigenvector when it belongs to an lq ball for q ∈ [0, 1]. Our bounds are sharp in p and n for all q ∈ [0, 1] over a wide cla...
متن کاملInformative spectro-temporal bottleneck features for noise-robust speech recognition
Spectro-temporal Gabor features based on auditory knowledge have improved word accuracy for automatic speech recognition in the presence of noise. In previous work, we generated robust spectro-temporal features that incorporated the power normalized cepstral coefficient (PNCC) algorithm. The corresponding power normalized spectrum (PNS) is then processed by many Gabor filters, yielding a high d...
متن کامل